A Problem in Enumerating Extreme Points
نویسنده
چکیده
We describe the central problem in developing an efficient algorithm for enumerating the extreme points of a convex polytope specified by linear constraints, and discuss a conjecture for its solution.
منابع مشابه
Segments in enumerating faces
We introduce the concept of a segment of a degenerate convex polytope specified by a system of linear constraints, and explain its importance in developing algorithms for enumerating the faces. Using segments, we describe an algorithm that enumerates all the faces, in time polynomial in their number. The role of segments in the unsolved problem of enumerating the extreme points of a convex poly...
متن کاملA problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
We consider the problem of developing an efficient algorithm for enumerating the extreme points of a convex polytope specified by linear constraints. Murty and Chung [8] introduced the concept of a segment of a polytope, and used it to develop some steps for carrying out the enumeration efficiently until the convex hull of the set of known extreme points becomes a segment. That effort stops wit...
متن کاملEnumerating Extreme Points in Higher Dimensions
We consider the problem of enumerating all extreme points of a given set P of n points in d dimensions. We present an algorithm with O(n) space and O(nm) time where m is the number of extreme points of P. We also present an algorithm to compute the depth of each point of the given set of n points in d-dimensions. This algorithm has complexity O(n 2) which signiicantly improves the O(n 3) comple...
متن کاملFinding the Best Coefficients in the Objective Function of a Linear Quadratic Control Problem
Finding the best weights of the state variables and the control variables in the objective function of a linear-quadratic control problem is considered. The weights of these variables are considered as two diagonal matrices with appropriate size and so the objective function of the control problem becomes a function of the diagonal elements of these matrices. The optimization problem which is d...
متن کاملCharacterization of efficient points of the production possibility set under variable returns to scale in DEA
We suggest a method for finding the non-dominated points of the production possibility set (PPS) with variable returns to scale (VRS) technology in data envelopment analysis (DEA). We present a multiobjective linear programming (MOLP) problem whose feasible region is the same as the PPS under variable returns to scale for generating non-dominated points. We demonstrate that Pareto solutions o...
متن کامل